________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 11:40:57
Input Data from:  dataset160.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :20
Ex.Facilities   :3
Total budget    :25000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,1565
Average f[i]   :4500
Average g[i,j] :2031,37254901961
Total demand   :10910
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 18
> Selected Move:	2080	1	-1	15	4500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0    >new incumb.: 2080


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 81
> Selected Move:	3230	1	-1	18	11000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0    >new incumb.: 3230


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 52
> Selected Move:	4190	1	-1	13	17500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0    >new incumb.: 4190


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 47
> Selected Move:	5130	1	-1	17	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  1  0    >new incumb.: 5130


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 55
> Selected Move:	5130	3	15	12	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 68
> Selected Move:	5130	3	18	11	22500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 67
> Selected Move:	5270	3	2	5	24800


> New Y[]: 
	
	 2  3  0  0  0  4  0  0  0  0  0  1  1  1  0  0  0  1  0  0    >new incumb.: 5270


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 64
> Selected Move:	5300	3	12	15	24300


> New Y[]: 
	
	 2  3  0  0  0  4  0  0  0  0  0  1  0  1  0  1  0  1  0  0    >new incumb.: 5300


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 67
> Selected Move:	5300	4	5	11	24100


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  4  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 71
> Selected Move:	5340	3	11	18	23500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  0  1  0  1  0  1  4  0    >new incumb.: 5340


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 67
> Selected Move:	5450	3	1	4	25000


> New Y[]: 
	
	 2  0  0  0  3  1  0  0  0  0  0  0  0  1  0  1  0  1  4  0    >new incumb.: 5450


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 51
> Selected Move:	5450	4	4	5	25000


> New Y[]: 
	
	 2  0  0  0  1  3  0  0  0  0  0  0  0  1  0  1  0  1  4  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 48
> Selected Move:	5450	4	5	13	23000


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  0  0  3  0  1  0  1  4  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 66
> Selected Move:	5540	3	4	6	24500


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  0  0  0  0  3  0  1  0  1  4  0    >new incumb.: 5540


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 55
> Selected Move:	5540	4	13	17	24600


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  0  0  0  0  1  0  1  0  3  4  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 53
> Selected Move:	5540	3	13	3	24600


> New Y[]: 
	
	 2  0  0  1  0  1  1  0  0  0  0  0  0  0  0  1  0  3  4  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 41
> Selected Move:	5540	4	17	3	24300


> New Y[]: 
	
	 2  0  0  3  0  1  1  0  0  0  0  0  0  0  0  1  0  1  4  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 52
> Selected Move:	5540	3	5	16	24800


> New Y[]: 
	
	 2  0  0  3  0  0  1  0  0  0  0  0  0  0  0  1  1  1  4  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 55
> Selected Move:	5540	3	3	13	25000


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  0  0  0  3  0  1  1  1  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 37
> Selected Move:	5497	4	13	17	25100


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  1  3  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 39
> Selected Move:	5497	3	13	3	25100


> New Y[]: 
	
	 2  0  0  1  0  0  1  0  0  0  0  0  0  0  0  1  1  3  4  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 59
> Selected Move:	5450	3	6	4	23600


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  1  1  3  4  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 71
> Selected Move:	5450	4	17	3	23300


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  0  0  1  1  1  4  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 74
> Selected Move:	5450	4	3	16	24600


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  1  3  1  4  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 64
> Selected Move:	5450	3	3	13	24600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  1  0  1  3  1  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 46
> Selected Move:	5450	4	16	13	23500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  3  0  1  1  1  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 50
> Selected Move:	5450	4	13	17	23600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  1  0  1  1  3  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 50
> Selected Move:	5450	4	17	18	25000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  1  0  1  1  4  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 40
> Selected Move:	5450	4	17	13	24500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  4  0  1  1  1  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 49
> Selected Move:	5450	4	18	17	24100


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  4  0  1  1  3  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 51
> Selected Move:	5450	4	13	17	24500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  3  0  1  1  4  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 47
> Selected Move:	5450	4	17	16	25000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  3  0  1  4  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 45
> Selected Move:	5450	3	13	3	24800


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  0  0  1  4  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 65
> Selected Move:	5450	4	16	17	24300


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  0  0  1  1  4  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 68
> Selected Move:	5450	4	3	17	24400


> New Y[]: 
	
	 2  0  0  4  1  0  0  0  0  0  0  0  0  0  0  1  1  3  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 67
> Selected Move:	5450	4	17	18	24800


> New Y[]: 
	
	 2  0  0  4  1  0  0  0  0  0  0  0  0  0  0  1  1  1  3  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 64
> Selected Move:	5450	4	3	17	25000


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  1  1  4  3  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 64
> Selected Move:	5450	3	16	5	24500


> New Y[]: 
	
	 2  0  0  1  1  1  0  0  0  0  0  0  0  0  0  1  0  4  3  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 61
> Selected Move:	5450	4	17	3	24300


> New Y[]: 
	
	 2  0  0  4  1  1  0  0  0  0  0  0  0  0  0  1  0  1  3  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 65
> Selected Move:	5450	4	3	18	22800


> New Y[]: 
	
	 2  0  0  3  1  1  0  0  0  0  0  0  0  0  0  1  0  1  4  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 76
> Selected Move:	5450	4	3	4	25000


> New Y[]: 
	
	 2  0  0  1  3  1  0  0  0  0  0  0  0  0  0  1  0  1  4  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 49
> Selected Move:	5450	4	4	5	25000


> New Y[]: 
	
	 2  0  0  1  1  3  0  0  0  0  0  0  0  0  0  1  0  1  4  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 46
> Selected Move:	5450	4	5	15	25000


> New Y[]: 
	
	 2  0  0  1  1  1  0  0  0  0  0  0  0  0  0  3  0  1  4  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 49
> Selected Move:	5450	4	15	17	23100


> New Y[]: 
	
	 2  0  0  1  1  1  0  0  0  0  0  0  0  0  0  1  0  3  4  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 71
> Selected Move:	5450	4	18	3	23900


> New Y[]: 
	
	 2  0  0  4  1  1  0  0  0  0  0  0  0  0  0  1  0  3  1  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 69
> Selected Move:	5450	4	3	17	23800


> New Y[]: 
	
	 2  0  0  3  1  1  0  0  0  0  0  0  0  0  0  1  0  4  1  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 72
> Selected Move:	5450	3	3	13	24000


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  0  0  3  0  1  0  4  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 70
> Selected Move:	5450	4	13	17	23600


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  0  0  4  0  1  0  3  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 69
> Selected Move:	5511	3	4	6	25100


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  0  0  0  0  4  0  1  0  3  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 66
> Selected Move:	5530	3	18	19	24600


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  0  0  0  0  4  0  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 67
> Selected Move:	5530	4	13	17	25000


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  0  0  0  0  3  0  1  0  4  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 62
> Selected Move:	5520	3	13	3	24800


> New Y[]: 
	
	 2  0  0  3  0  1  1  0  0  0  0  0  0  0  0  1  0  4  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 53
> Selected Move:	5520	4	3	17	24900


> New Y[]: 
	
	 2  0  0  4  0  1  1  0  0  0  0  0  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 54
> Selected Move:	5494	4	17	19	25100


> New Y[]: 
	
	 2  0  0  4  0  1  1  0  0  0  0  0  0  0  0  1  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 47
> Selected Move:	5530	3	3	13	24800


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  0  0  0  0  4  0  1  0  1  0  3 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 70
> Selected Move:	5454	4	13	17	25300


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  0  0  0  0  1  0  1  0  4  0  3 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 69
> Selected Move:	5450	3	6	4	23800


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  0  0  1  0  1  0  4  0  3 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 75
> Selected Move:	5450	4	17	13	23300


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  0  0  4  0  1  0  1  0  3 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 76
> Selected Move:	5450	4	13	19	23800


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  0  0  3  0  1  0  1  0  4 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,235

## ITERATION 59 #######################


> Neighbours evaluated; 72
> Selected Move:	5460	3	4	6	25300


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  0  0  0  0  3  0  1  0  1  0  4 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,23

## ITERATION 60 #######################


> Neighbours evaluated; 63
> Selected Move:	5497	3	13	3	25100


> New Y[]: 
	
	 2  0  0  3  0  1  1  0  0  0  0  0  0  0  0  1  0  1  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,225

## ITERATION 61 #######################


> Neighbours evaluated; 60
> Selected Move:	5450	3	6	4	23600


> New Y[]: 
	
	 2  0  0  3  1  1  0  0  0  0  0  0  0  0  0  1  0  1  0  4 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,22

## ITERATION 62 #######################


> Neighbours evaluated; 79
> Selected Move:	5450	4	3	17	23900


> New Y[]: 
	
	 2  0  0  1  1  1  0  0  0  0  0  0  0  0  0  1  0  3  0  4 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,215

## ITERATION 63 #######################


> Neighbours evaluated; 77
> Selected Move:	5450	4	17	19	23800


> New Y[]: 
	
	 2  0  0  1  1  1  0  0  0  0  0  0  0  0  0  1  0  4  0  3 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,21

## ITERATION 64 #######################


> Neighbours evaluated; 73
> Selected Move:	5457	3	4	6	25300


> New Y[]: 
	
	 2  0  0  1  0  1  1  0  0  0  0  0  0  0  0  1  0  4  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,205

## ITERATION 65 #######################


> Neighbours evaluated; 55
> Selected Move:	5438	4	17	19	25400


> New Y[]: 
	
	 2  0  0  1  0  1  1  0  0  0  0  0  0  0  0  1  0  3  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,2

## ITERATION 66 #######################


> Neighbours evaluated; 55
> Selected Move:	5450	3	3	13	25400


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  0  0  0  0  1  0  1  0  3  0  4 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,205

## ITERATION 67 #######################


> Neighbours evaluated; 67
> Selected Move:	5450	3	6	4	23900


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  0  0  1  0  1  0  3  0  4 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,21

## ITERATION 68 #######################


> Neighbours evaluated; 72
> Selected Move:	5450	4	19	13	23100


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  0  0  4  0  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,215

## ITERATION 69 #######################


> Neighbours evaluated; 75
> Selected Move:	5450	4	13	15	24900


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  0  0  1  0  4  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,21

## ITERATION 70 #######################


> Neighbours evaluated; 69
> Selected Move:	5450	4	17	13	24800


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  0  0  3  0  4  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,205

## ITERATION 71 #######################


> Neighbours evaluated; 69
> Selected Move:	5450	4	13	15	25000


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  0  0  4  0  3  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,2

## ITERATION 72 #######################


> Neighbours evaluated; 66
> Selected Move:	5450	4	15	4	25000


> New Y[]: 
	
	 2  0  0  0  3  1  0  0  0  0  0  0  0  4  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,195

## ITERATION 73 #######################


> Neighbours evaluated; 67
> Selected Move:	5450	4	4	5	25000


> New Y[]: 
	
	 2  0  0  0  1  3  0  0  0  0  0  0  0  4  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,19

## ITERATION 74 #######################


> Neighbours evaluated; 68
> Selected Move:	5450	3	5	16	24600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  4  0  1  3  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1 
 > pw :0,185

## ITERATION 75 #######################


> Neighbours evaluated; 60
> Selected Move:	5450	4	13	16	24500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  3  0  1  4  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1 
 > pw :0,18

## ITERATION 76 #######################


> Neighbours evaluated; 60
> Selected Move:	5450	4	13	17	24600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  1  0  1  4  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1 
 > pw :0,175

## ITERATION 77 #######################


> Neighbours evaluated; 62
> Selected Move:	5450	4	16	13	23600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  4  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1 
 > pw :0,17

## ITERATION 78 #######################


> Neighbours evaluated; 60
> Selected Move:	5523	1	-1	5	28100


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  0  0  4  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  1 
 > pw :0,165

## ITERATION 79 #######################


> Neighbours evaluated; 99
> Selected Move:	5616	3	19	11	26600


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  1  0  4  0  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,16

## ITERATION 80 #######################


> Neighbours evaluated; 112
> Selected Move:	5634	3	16	12	26600


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  1  1  4  0  1  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,155

## ITERATION 81 #######################


> Neighbours evaluated; 112
> Selected Move:	5627	3	17	7	26700


> New Y[]: 
	
	 2  0  0  0  1  1  0  3  0  0  0  1  1  4  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 82 #######################


> Neighbours evaluated; 88
> Selected Move:	5695	4	7	12	26300


> New Y[]: 
	
	 2  0  0  0  1  1  0  1  0  0  0  1  3  4  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 83 #######################


> Neighbours evaluated; 91
> Selected Move:	5700	3	12	18	27000


> New Y[]: 
	
	 2  0  0  0  1  1  0  1  0  0  0  1  0  4  0  1  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 84 #######################


> Neighbours evaluated; 79
> Selected Move:	5850	4	13	18	26000


> New Y[]: 
	
	 2  0  0  0  1  1  0  1  0  0  0  1  0  3  0  1  0  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 85 #######################


> Neighbours evaluated; 79
> Selected Move:	5980	3	7	10	25000


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  1  1  0  3  0  1  0  0  4  0    >new incumb.: 5980


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 86 #######################


> Neighbours evaluated; 81
> Selected Move:	5895	3	5	16	25500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  1  1  0  3  0  1  1  0  4  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,175

## ITERATION 87 #######################


> Neighbours evaluated; 72
> Selected Move:	5898	3	13	3	25300


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  1  1  0  0  0  1  1  0  4  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,18

## ITERATION 88 #######################


> Neighbours evaluated; 82
> Selected Move:	5840	3	16	5	24800


> New Y[]: 
	
	 2  0  0  3  1  1  0  0  0  0  1  1  0  0  0  1  0  0  4  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,185

## ITERATION 89 #######################


> Neighbours evaluated; 79
> Selected Move:	5862	3	10	7	25800


> New Y[]: 
	
	 2  0  0  3  1  1  0  1  0  0  0  1  0  0  0  1  0  0  4  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 90 #######################


> Neighbours evaluated; 90
> Selected Move:	5763	3	5	16	26300


> New Y[]: 
	
	 2  0  0  3  1  0  0  1  0  0  0  1  0  0  0  1  1  0  4  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,195

## ITERATION 91 #######################


> Neighbours evaluated; 88
> Selected Move:	5718	3	3	13	26500


> New Y[]: 
	
	 2  0  0  0  1  0  0  1  0  0  0  1  0  3  0  1  1  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,2

## ITERATION 92 #######################


> Neighbours evaluated; 72
> Selected Move:	5960	3	18	2	25000


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  0  0  0  1  0  3  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,205

## ITERATION 93 #######################


> Neighbours evaluated; 62
> Selected Move:	5890	3	16	12	25000


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  0  0  0  1  1  3  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 94 #######################


> Neighbours evaluated; 76
> Selected Move:	5855	3	15	16	25500


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  0  0  0  1  1  3  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  1  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 95 #######################


> Neighbours evaluated; 70
> Selected Move:	5803	3	11	15	25500


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  0  0  0  0  1  3  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,22

## ITERATION 96 #######################


> Neighbours evaluated; 83
> Selected Move:	5740	3	7	14	25000


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  0  1  3  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,225

## ITERATION 97 #######################


> Neighbours evaluated; 107
> Selected Move:	5790	3	12	11	24500


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  1  0  3  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,23

## ITERATION 98 #######################


> Neighbours evaluated; 94
> Selected Move:	5825	3	14	17	26500


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  1  0  3  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,235

## ITERATION 99 #######################


> Neighbours evaluated; 59
> Selected Move:	5794	4	13	17	26600


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  1  0  1  0  1  1  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,24

## ITERATION 100 #######################


> Neighbours evaluated; 77
> Selected Move:	5696	3	13	12	25100


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  1  1  0  0  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,245

## ITERATION 101 #######################


> Neighbours evaluated; 104
> Selected Move:	5720	3	17	13	25000


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  1  1  3  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 102 #######################


> Neighbours evaluated; 92
> Selected Move:	5790	3	15	14	25000


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  1  1  3  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  1  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 103 #######################


> Neighbours evaluated; 101
> Selected Move:	5730	3	14	10	24500


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  1  3  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  1  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 104 #######################


> Neighbours evaluated; 64
> Selected Move:	5730	3	12	15	24000


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  0  3  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,255

## ITERATION 105 #######################


> Neighbours evaluated; 59
> Selected Move:	5750	3	16	19	25000


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  0  3  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 106 #######################


> Neighbours evaluated; 61
> Selected Move:	5745	3	19	18	25500


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  0  3  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 107 #######################


> Neighbours evaluated; 52
> Selected Move:	5706	3	13	16	25100


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  0  0  0  1  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0 
 > pw :0,25

## ITERATION 108 #######################


> Neighbours evaluated; 49
> Selected Move:	5730	4	16	18	24500


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  0  0  0  1  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0 
 > pw :0,245

## ITERATION 109 #######################


> Neighbours evaluated; 59
> Selected Move:	5760	3	10	14	25000


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  1  0  0  1  1  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,24

## ITERATION 110 #######################


> Neighbours evaluated; 70
> Selected Move:	5720	3	14	7	25500


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  0  0  0  1  0  0  0  1  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 111 #######################


> Neighbours evaluated; 66
> Selected Move:	5720	3	18	12	24800


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  0  0  0  1  3  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 112 #######################


> Neighbours evaluated; 80
> Selected Move:	5720	4	12	16	24600


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  0  0  0  1  1  0  0  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 113 #######################


> Neighbours evaluated; 81
> Selected Move:	5713	3	12	13	26100


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  0  0  0  1  0  1  0  1  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,22

## ITERATION 114 #######################


> Neighbours evaluated; 58
> Selected Move:	5708	3	7	10	25100


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  0  1  0  1  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,225

## ITERATION 115 #######################


> Neighbours evaluated; 54
> Selected Move:	5720	3	13	19	24600


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  0  0  0  1  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 116 #######################


> Neighbours evaluated; 54
> Selected Move:	5720	4	16	19	23800


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  0  0  0  1  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 117 #######################


> Neighbours evaluated; 72
> Selected Move:	5720	3	10	7	24800


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  0  0  0  1  0  0  0  1  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 118 #######################


> Neighbours evaluated; 75
> Selected Move:	5710	3	19	3	24800


> New Y[]: 
	
	 2  0  4  3  1  0  0  1  0  0  0  1  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0 
 > pw :0,215

## ITERATION 119 #######################


> Neighbours evaluated; 65
> Selected Move:	5646	3	15	12	25300


> New Y[]: 
	
	 2  0  4  3  1  0  0  1  0  0  0  1  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 120 #######################


> Neighbours evaluated; 63
> Selected Move:	5615	3	3	15	25500


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  0  0  0  1  1  0  0  3  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 121 #######################


> Neighbours evaluated; 74
> Selected Move:	5680	3	7	10	24500


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  1  0  0  3  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0 
 > pw :0,2

## ITERATION 122 #######################


> Neighbours evaluated; 74
> Selected Move:	5680	4	15	4	24500


> New Y[]: 
	
	 2  0  4  0  3  0  0  0  0  0  1  1  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0 
 > pw :0,195

## ITERATION 123 #######################


> Neighbours evaluated; 73
> Selected Move:	5720	3	4	13	25000


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  1  1  1  3  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 124 #######################


> Neighbours evaluated; 108
> Selected Move:	5735	3	12	6	25500


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  1  1  0  3  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,185

## ITERATION 125 #######################


> Neighbours evaluated; 62
> Selected Move:	5783	3	10	7	26500


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  1  0  3  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,18

## ITERATION 126 #######################


> Neighbours evaluated; 69
> Selected Move:	5710	3	7	14	26000


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  0  3  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,185

## ITERATION 127 #######################


> Neighbours evaluated; 95
> Selected Move:	5675	3	14	17	28000


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  0  3  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0 
 > pw :0,19

## ITERATION 128 #######################


> Neighbours evaluated; 62
> Selected Move:	5641	4	13	17	28100


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  0  1  0  1  1  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0 
 > pw :0,195

## ITERATION 129 #######################


> Neighbours evaluated; 74
> Selected Move:	5558	3	6	10	26600


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  1  1  0  1  0  1  1  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,2

## ITERATION 130 #######################


> Neighbours evaluated; 82
> Selected Move:	5720	3	17	1	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  1  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,205

## ITERATION 131 #######################


> Neighbours evaluated; 60
> Selected Move:	5848	3	10	7	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  1  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,21

## ITERATION 132 #######################


> Neighbours evaluated; 65
> Selected Move:	5780	3	7	14	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,215

## ITERATION 133 #######################


> Neighbours evaluated; 96
> Selected Move:	5760	3	13	18	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,22

## ITERATION 134 #######################


> Neighbours evaluated; 81
> Selected Move:	5730	3	14	7	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  1  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 135 #######################


> Neighbours evaluated; 67
> Selected Move:	5720	3	7	10	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  1  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0 
 > pw :0,23

## ITERATION 136 #######################


> Neighbours evaluated; 66
> Selected Move:	5720	3	18	19	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  1  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 137 #######################


> Neighbours evaluated; 68
> Selected Move:	5720	3	10	7	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  1  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 138 #######################


> Neighbours evaluated; 80
> Selected Move:	5720	3	19	12	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  1  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 139 #######################


> Neighbours evaluated; 82
> Selected Move:	5768	3	16	13	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  1  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 140 #######################


> Neighbours evaluated; 74
> Selected Move:	5740	3	12	5	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  1  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,215

## ITERATION 141 #######################


> Neighbours evaluated; 66
> Selected Move:	5678	3	2	18	26500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  1  0  1  0  1  0  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 142 #######################


> Neighbours evaluated; 79
> Selected Move:	5875	3	7	10	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  1  0  1  0  1  0  0  4  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 143 #######################


> Neighbours evaluated; 78
> Selected Move:	5775	4	18	13	26000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  1  0  4  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 144 #######################


> Neighbours evaluated; 81
> Selected Move:	5670	3	18	12	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  1  1  4  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 145 #######################


> Neighbours evaluated; 90
> Selected Move:	5778	3	10	7	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  1  1  4  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 146 #######################


> Neighbours evaluated; 93
> Selected Move:	5730	3	7	14	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  1  4  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 147 #######################


> Neighbours evaluated; 118
> Selected Move:	5666	3	13	3	25300


> New Y[]: 
	
	 2  3  0  4  0  1  0  0  0  0  0  1  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 148 #######################


> Neighbours evaluated; 108
> Selected Move:	5704	3	14	7	25800


> New Y[]: 
	
	 2  3  0  4  0  1  0  1  0  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 149 #######################


> Neighbours evaluated; 96
> Selected Move:	5670	3	7	10	24800


> New Y[]: 
	
	 2  3  0  4  0  1  0  0  0  0  1  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 150 #######################


> Neighbours evaluated; 95
> Selected Move:	5601	3	5	16	25300


> New Y[]: 
	
	 2  3  0  4  0  0  0  0  0  0  1  1  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0 
 > pw :0,235

## ITERATION 151 #######################


> Neighbours evaluated; 94
> Selected Move:	5670	3	3	2	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  1  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0 
 > pw :0,24

## ITERATION 152 #######################


> Neighbours evaluated; 75
> Selected Move:	5720	3	0	13	24800


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  1  1  1  2  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 153 #######################


> Neighbours evaluated; 110
> Selected Move:	5704	3	15	8	25800


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  1  0  1  1  1  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 154 #######################


> Neighbours evaluated; 59
> Selected Move:	5615	3	16	5	25300


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  1  0  1  1  1  2  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 155 #######################


> Neighbours evaluated; 58
> Selected Move:	5510	3	8	15	24300


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  1  1  1  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 156 #######################


> Neighbours evaluated; 93
> Selected Move:	5630	3	12	6	24800


> New Y[]: 
	
	 0  3  4  0  0  1  1  0  0  0  1  1  0  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,265

## ITERATION 157 #######################


> Neighbours evaluated; 47
> Selected Move:	5648	3	10	7	25800


> New Y[]: 
	
	 0  3  4  0  0  1  1  1  0  0  0  1  0  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,27

## ITERATION 158 #######################


> Neighbours evaluated; 55
> Selected Move:	5610	3	6	4	24300


> New Y[]: 
	
	 0  3  4  0  1  1  0  1  0  0  0  1  0  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,265

## ITERATION 159 #######################


> Neighbours evaluated; 50
> Selected Move:	5610	3	5	16	24800


> New Y[]: 
	
	 0  3  4  0  1  0  0  1  0  0  0  1  0  2  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0 
 > pw :0,26

## ITERATION 160 #######################


> Neighbours evaluated; 63
> Selected Move:	5630	3	7	12	24800


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  1  2  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,255

## ITERATION 161 #######################


> Neighbours evaluated; 96
> Selected Move:	5630	3	13	17	24500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  1  0  0  1  1  2  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,25

## ITERATION 162 #######################


> Neighbours evaluated; 97
> Selected Move:	5550	3	17	7	24500


> New Y[]: 
	
	 0  3  4  0  1  0  0  2  0  0  0  1  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0 
 > pw :0,245

## ITERATION 163 #######################


> Neighbours evaluated; 71
> Selected Move:	5550	4	7	16	25000


> New Y[]: 
	
	 0  3  4  0  1  0  0  1  0  0  0  1  1  0  0  1  2  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0 
 > pw :0,24

## ITERATION 164 #######################


> Neighbours evaluated; 72
> Selected Move:	5550	3	16	13	24800


> New Y[]: 
	
	 0  3  4  0  1  0  0  1  0  0  0  1  1  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,235

## ITERATION 165 #######################


> Neighbours evaluated; 67
> Selected Move:	5610	3	11	5	24800


> New Y[]: 
	
	 0  3  4  0  1  1  0  1  0  0  0  0  1  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0 
 > pw :0,23

## ITERATION 166 #######################


> Neighbours evaluated; 69
> Selected Move:	5581	3	5	16	25300


> New Y[]: 
	
	 0  3  4  0  1  0  0  1  0  0  0  0  1  2  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,225

## ITERATION 167 #######################


> Neighbours evaluated; 78
> Selected Move:	5540	3	4	11	25800


> New Y[]: 
	
	 0  3  4  0  0  0  0  1  0  0  0  1  1  2  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 168 #######################


> Neighbours evaluated; 107
> Selected Move:	5594	3	15	8	26800


> New Y[]: 
	
	 0  3  4  0  0  0  0  1  1  0  0  1  1  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 169 #######################


> Neighbours evaluated; 79
> Selected Move:	5511	3	7	14	26300


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  1  0  0  1  1  2  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 170 #######################


> Neighbours evaluated; 103
> Selected Move:	5577	3	8	15	25300


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  1  1  2  1  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,215

## ITERATION 171 #######################


> Neighbours evaluated; 117
> Selected Move:	5640	3	13	0	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  1  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,22

## ITERATION 172 #######################


> Neighbours evaluated; 111
> Selected Move:	5720	3	14	9	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  1  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 173 #######################


> Neighbours evaluated; 84
> Selected Move:	5608	3	9	13	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  1  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 174 #######################


> Neighbours evaluated; 96
> Selected Move:	5720	3	15	7	26000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  1  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  1  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 175 #######################


> Neighbours evaluated; 67
> Selected Move:	5720	3	7	10	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  1  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  1  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 176 #######################


> Neighbours evaluated; 65
> Selected Move:	5670	3	11	15	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  0  1  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,245

## ITERATION 177 #######################


> Neighbours evaluated; 79
> Selected Move:	5670	3	16	11	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  1  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 178 #######################


> Neighbours evaluated; 73
> Selected Move:	5640	3	10	14	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  1  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 179 #######################


> Neighbours evaluated; 107
> Selected Move:	5658	3	15	16	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  1  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  1  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 180 #######################


> Neighbours evaluated; 101
> Selected Move:	5610	3	11	15	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  1  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,235

## ITERATION 181 #######################


> Neighbours evaluated; 116
> Selected Move:	5665	3	14	7	26000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  0  1  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,24

## ITERATION 182 #######################


> Neighbours evaluated; 85
> Selected Move:	5620	3	16	5	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0 
 > pw :0,245

## ITERATION 183 #######################


> Neighbours evaluated; 74
> Selected Move:	5618	3	15	11	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  1  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  1  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 184 #######################


> Neighbours evaluated; 65
> Selected Move:	5570	3	7	14	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  1  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 185 #######################


> Neighbours evaluated; 92
> Selected Move:	5570	3	12	15	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,26

## ITERATION 186 #######################


> Neighbours evaluated; 85
> Selected Move:	5610	3	2	18	26000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  0  1  1  1  0  0  4  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 187 #######################


> Neighbours evaluated; 115
> Selected Move:	5473	4	18	13	26500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  0  4  1  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 188 #######################


> Neighbours evaluated; 112
> Selected Move:	5570	3	13	2	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  0  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0 
 > pw :0,275

## ITERATION 189 #######################


> Neighbours evaluated; 84
> Selected Move:	5630	3	14	7	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  1  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 190 #######################


> Neighbours evaluated; 70
> Selected Move:	5510	3	7	10	24000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  1  1  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0 
 > pw :0,285

## ITERATION 191 #######################


> Neighbours evaluated; 57
> Selected Move:	5585	3	5	13	26000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  1  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 192 #######################


> Neighbours evaluated; 64
> Selected Move:	5605	3	18	19	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  1  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,295

## ITERATION 193 #######################


> Neighbours evaluated; 68
> Selected Move:	5510	3	13	5	23500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  1  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 194 #######################


> Neighbours evaluated; 64
> Selected Move:	5605	3	2	13	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  1  0  4  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,295

## ITERATION 195 #######################


> Neighbours evaluated; 86
> Selected Move:	5455	3	5	16	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  1  0  4  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0 
 > pw :0,3

## ITERATION 196 #######################


> Neighbours evaluated; 72
> Selected Move:	5670	3	19	12	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  1  1  4  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0  0 
 > pw :0,305

## ITERATION 197 #######################


> Neighbours evaluated; 76
> Selected Move:	5578	3	10	14	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  1  4  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0  0 
 > pw :0,31

## ITERATION 198 #######################


> Neighbours evaluated; 108
> Selected Move:	5570	3	14	7	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  1  1  4  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,315

## ITERATION 199 #######################


> Neighbours evaluated; 78
> Selected Move:	5513	3	12	5	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  1  0  4  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,32

## ITERATION 200 #######################


> Neighbours evaluated; 103
> Selected Move:	5480	3	13	18	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  1  0  0  0  1  1  0  4  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 201 #######################


> Neighbours evaluated; 102
> Selected Move:	5513	3	16	3	26500


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  0  0  0  1  0  0  0  1  0  0  4  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 202 #######################


> Neighbours evaluated; 58
> Selected Move:	5675	3	7	10	25500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  1  1  0  0  0  1  0  0  4  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,335

## ITERATION 203 #######################


> Neighbours evaluated; 65
> Selected Move:	5615	3	5	16	26000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  1  0  0  0  1  1  0  4  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,34

## ITERATION 204 #######################


> Neighbours evaluated; 68
> Selected Move:	5640	3	3	13	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  1  0  1  0  1  1  0  4  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,345

## ITERATION 205 #######################


> Neighbours evaluated; 55
> Selected Move:	5463	4	18	13	26500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  1  0  4  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,35

## ITERATION 206 #######################


> Neighbours evaluated; 58
> Selected Move:	5320	3	13	3	26800


> New Y[]: 
	
	 2  3  0  4  0  0  0  0  0  0  1  1  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,355

## ITERATION 207 #######################


> Neighbours evaluated; 78
> Selected Move:	5379	3	16	5	26300


> New Y[]: 
	
	 2  3  0  4  0  1  0  0  0  0  1  1  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,36

## ITERATION 208 #######################


> Neighbours evaluated; 83
> Selected Move:	5262	3	18	19	25800


> New Y[]: 
	
	 2  3  0  4  0  1  0  0  0  0  1  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,365

## ITERATION 209 #######################


> Neighbours evaluated; 88
> Selected Move:	5223	3	10	7	26800


> New Y[]: 
	
	 2  3  0  4  0  1  0  1  0  0  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 210 #######################


> Neighbours evaluated; 55
> Selected Move:	5510	3	3	2	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 211 #######################


> Neighbours evaluated; 76
> Selected Move:	5510	3	7	14	24000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  0  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,38

## ITERATION 212 #######################


> Neighbours evaluated; 80
> Selected Move:	5640	3	5	16	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,385

## ITERATION 213 #######################


> Neighbours evaluated; 87
> Selected Move:	5590	3	19	3	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,39

## ITERATION 214 #######################


> Neighbours evaluated; 72
> Selected Move:	5570	3	14	10	24500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  1  1  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  1  0  0  0 
 > pw :0,395

## ITERATION 215 #######################


> Neighbours evaluated; 54
> Selected Move:	5570	3	15	12	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  1  1  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0  0  0 
 > pw :0,39

## ITERATION 216 #######################


> Neighbours evaluated; 59
> Selected Move:	5570	3	16	15	24500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  1  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  1  0  0  0  0 
 > pw :0,385

## ITERATION 217 #######################


> Neighbours evaluated; 54
> Selected Move:	5570	3	10	14	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  1  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,38

## ITERATION 218 #######################


> Neighbours evaluated; 81
> Selected Move:	5510	3	3	5	23000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,375

## ITERATION 219 #######################


> Neighbours evaluated; 89
> Selected Move:	5550	3	11	13	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  1  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 220 #######################


> Neighbours evaluated; 94
> Selected Move:	5510	3	14	10	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  1  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0 
 > pw :0,365

## ITERATION 221 #######################


> Neighbours evaluated; 54
> Selected Move:	5510	3	10	11	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 222 #######################


> Neighbours evaluated; 75
> Selected Move:	5510	3	12	10	24000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  1  1  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,355

## ITERATION 223 #######################


> Neighbours evaluated; 54
> Selected Move:	5510	3	13	12	22500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  1  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  1  0  0  0  0 
 > pw :0,35

## ITERATION 224 #######################


> Neighbours evaluated; 62
> Selected Move:	5510	3	0	6	24500


> New Y[]: 
	
	 0  3  4  0  0  1  2  0  0  0  1  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 225 #######################


> Neighbours evaluated; 52
> Selected Move:	5570	3	5	16	25000


> New Y[]: 
	
	 0  3  4  0  0  0  2  0  0  0  1  1  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0 
 > pw :0,34

## ITERATION 226 #######################


> Neighbours evaluated; 57
> Selected Move:	5470	3	6	17	24500


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  1  1  1  0  0  1  1  2  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,335

## ITERATION 227 #######################


> Neighbours evaluated; 106
> Selected Move:	5470	3	16	5	24000


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  1  1  1  0  0  1  0  2  0  0 


> New S[]: 
	
	 0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 228 #######################


> Neighbours evaluated; 94
> Selected Move:	5510	3	10	4	24000


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  0  0  0  1  1  0  0  1  0  2  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,325

## ITERATION 229 #######################


> Neighbours evaluated; 88
> Selected Move:	5558	3	12	13	25500


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  0  0  0  1  0  1  0  1  0  2  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,32

## ITERATION 230 #######################


> Neighbours evaluated; 58
> Selected Move:	5510	3	4	10	25500


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  1  1  0  1  0  1  0  2  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,315

## ITERATION 231 #######################


> Neighbours evaluated; 75
> Selected Move:	5418	4	17	13	25800


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  1  1  0  2  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,31

## ITERATION 232 #######################


> Neighbours evaluated; 84
> Selected Move:	5472	3	10	4	25800


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  0  0  0  1  0  2  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,305

## ITERATION 233 #######################


> Neighbours evaluated; 68
> Selected Move:	5510	3	17	12	24300


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  0  0  0  1  1  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 234 #######################


> Neighbours evaluated; 79
> Selected Move:	5550	3	15	7	24800


> New Y[]: 
	
	 0  3  4  0  1  1  0  1  0  0  0  1  1  2  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 235 #######################


> Neighbours evaluated; 67
> Selected Move:	5462	3	5	16	25300


> New Y[]: 
	
	 0  3  4  0  1  0  0  1  0  0  0  1  1  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,3

## ITERATION 236 #######################


> Neighbours evaluated; 63
> Selected Move:	5380	3	7	14	24800


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  1  2  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,305

## ITERATION 237 #######################


> Neighbours evaluated; 99
> Selected Move:	5480	3	11	15	24800


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  1  2  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,31

## ITERATION 238 #######################


> Neighbours evaluated; 109
> Selected Move:	5449	3	13	3	25100


> New Y[]: 
	
	 0  3  4  2  1  0  0  0  0  0  0  0  1  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,315

## ITERATION 239 #######################


> Neighbours evaluated; 85
> Selected Move:	5500	3	12	11	24600


> New Y[]: 
	
	 0  3  4  2  1  0  0  0  0  0  0  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  1  0  0  0 
 > pw :0,32

## ITERATION 240 #######################


> Neighbours evaluated; 75
> Selected Move:	5538	3	14	7	25100


> New Y[]: 
	
	 0  3  4  2  1  0  0  1  0  0  0  1  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0 
 > pw :0,325

## ITERATION 241 #######################


> Neighbours evaluated; 56
> Selected Move:	5518	3	16	12	25100


> New Y[]: 
	
	 0  3  4  2  1  0  0  1  0  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,33

## ITERATION 242 #######################


> Neighbours evaluated; 59
> Selected Move:	5457	3	7	16	25100


> New Y[]: 
	
	 0  3  4  2  1  0  0  0  0  0  0  1  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 243 #######################


> Neighbours evaluated; 67
> Selected Move:	5490	3	3	9	24800


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  2  0  1  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0 
 > pw :0,34

## ITERATION 244 #######################


> Neighbours evaluated; 65
> Selected Move:	5490	3	16	5	24300


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  0  2  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,345

## ITERATION 245 #######################


> Neighbours evaluated; 62
> Selected Move:	5510	3	9	7	24000


> New Y[]: 
	
	 0  3  4  0  1  1  0  2  0  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 246 #######################


> Neighbours evaluated; 60
> Selected Move:	5510	4	7	12	24800


> New Y[]: 
	
	 0  3  4  0  1  1  0  1  0  0  0  1  2  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 247 #######################


> Neighbours evaluated; 51
> Selected Move:	5477	4	12	4	25100


> New Y[]: 
	
	 0  3  4  0  2  1  0  1  0  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 248 #######################


> Neighbours evaluated; 45
> Selected Move:	5510	3	4	0	23500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 249 #######################


> Neighbours evaluated; 78
> Selected Move:	5510	3	1	4	25000


> New Y[]: 
	
	 2  0  4  0  3  1  0  1  0  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 250 #######################


> Neighbours evaluated; 54
> Selected Move:	5555	3	5	16	25500


> New Y[]: 
	
	 2  0  4  0  3  0  0  1  0  0  0  1  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 251 #######################


> Neighbours evaluated; 50
> Selected Move:	5655	4	4	7	25200


> New Y[]: 
	
	 2  0  4  0  1  0  0  3  0  0  0  1  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 252 #######################


> Neighbours evaluated; 60
> Selected Move:	5624	3	7	9	25300


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  3  0  1  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 253 #######################


> Neighbours evaluated; 62
> Selected Move:	5609	3	9	14	25100


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  1  1  0  3  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,32

## ITERATION 254 #######################


> Neighbours evaluated; 82
> Selected Move:	5640	4	14	4	25000


> New Y[]: 
	
	 2  0  4  0  3  0  0  0  0  0  0  1  1  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,325

## ITERATION 255 #######################


> Neighbours evaluated; 82
> Selected Move:	5640	4	4	12	24300


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  1  3  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,33

## ITERATION 256 #######################


> Neighbours evaluated; 99
> Selected Move:	5680	3	14	10	23800


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  3  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0 
 > pw :0,335

## ITERATION 257 #######################


> Neighbours evaluated; 62
> Selected Move:	5680	4	12	11	24700


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  3  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0 
 > pw :0,33

## ITERATION 258 #######################


> Neighbours evaluated; 48
> Selected Move:	5680	4	11	16	23600


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  1  0  0  1  3  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0 
 > pw :0,325

## ITERATION 259 #######################


> Neighbours evaluated; 68
> Selected Move:	5680	3	16	13	24000


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  1  3  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 260 #######################


> Neighbours evaluated; 63
> Selected Move:	5680	3	11	16	24500


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  0  1  3  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,315

## ITERATION 261 #######################


> Neighbours evaluated; 78
> Selected Move:	5590	3	13	18	25000


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  0  1  0  0  1  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 262 #######################


> Neighbours evaluated; 77
> Selected Move:	5490	3	18	3	24300


> New Y[]: 
	
	 2  0  4  3  1  0  0  0  0  0  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 263 #######################


> Neighbours evaluated; 56
> Selected Move:	5580	3	12	11	23800


> New Y[]: 
	
	 2  0  4  3  1  0  0  0  0  0  1  1  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  1  0  0  0 
 > pw :0,3

## ITERATION 264 #######################


> Neighbours evaluated; 51
> Selected Move:	5590	3	10	14	24300


> New Y[]: 
	
	 2  0  4  3  1  0  0  0  0  0  0  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,295

## ITERATION 265 #######################


> Neighbours evaluated; 77
> Selected Move:	5640	3	3	19	24300


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  1  0  0  1  1  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,29

## ITERATION 266 #######################


> Neighbours evaluated; 78
> Selected Move:	5611	4	19	16	25100


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  1  0  0  1  1  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,285

## ITERATION 267 #######################


> Neighbours evaluated; 78
> Selected Move:	5640	3	19	12	24100


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  1  1  0  1  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,28

## ITERATION 268 #######################


> Neighbours evaluated; 104
> Selected Move:	5640	4	16	15	25000


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  1  1  0  1  3  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,275

## ITERATION 269 #######################


> Neighbours evaluated; 96
> Selected Move:	5590	3	15	3	24800


> New Y[]: 
	
	 2  0  4  3  1  0  0  0  0  0  0  1  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 270 #######################


> Neighbours evaluated; 95
> Selected Move:	5580	3	14	10	24300


> New Y[]: 
	
	 2  0  4  3  1  0  0  0  0  0  1  1  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0  0  0 
 > pw :0,265

## ITERATION 271 #######################


> Neighbours evaluated; 65
> Selected Move:	5570	3	16	15	23800


> New Y[]: 
	
	 2  0  4  3  1  0  0  0  0  0  1  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 272 #######################


> Neighbours evaluated; 54
> Selected Move:	5602	3	2	16	25300


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  1  1  1  0  0  1  4  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0 
 > pw :0,255

## ITERATION 273 #######################


> Neighbours evaluated; 92
> Selected Move:	5559	3	10	7	26300


> New Y[]: 
	
	 2  0  0  3  1  0  0  1  0  0  0  1  1  0  0  1  4  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,25

## ITERATION 274 #######################


> Neighbours evaluated; 95
> Selected Move:	5570	3	16	2	24800


> New Y[]: 
	
	 2  0  4  3  1  0  0  1  0  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 275 #######################


> Neighbours evaluated; 68
> Selected Move:	5570	3	7	14	24300


> New Y[]: 
	
	 2  0  4  3  1  0  0  0  0  0  0  1  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,24

## ITERATION 276 #######################


> Neighbours evaluated; 88
> Selected Move:	5640	3	3	13	24500


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  1  1  3  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 277 #######################


> Neighbours evaluated; 102
> Selected Move:	5615	3	14	9	26000


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  1  0  1  1  3  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 278 #######################


> Neighbours evaluated; 64
> Selected Move:	5670	3	12	16	26000


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  1  0  1  0  3  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,225

## ITERATION 279 #######################


> Neighbours evaluated; 58
> Selected Move:	5578	3	16	5	25500


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  0  1  0  1  0  3  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,23

## ITERATION 280 #######################


> Neighbours evaluated; 42
> Selected Move:	5750	3	9	7	24500


> New Y[]: 
	
	 2  0  4  0  1  1  0  1  0  0  0  1  0  3  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,235

## ITERATION 281 #######################


> Neighbours evaluated; 63
> Selected Move:	5750	3	15	12	25000


> New Y[]: 
	
	 2  0  4  0  1  1  0  1  0  0  0  1  1  3  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  1  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 282 #######################


> Neighbours evaluated; 59
> Selected Move:	5740	3	11	15	25000


> New Y[]: 
	
	 2  0  4  0  1  1  0  1  0  0  0  0  1  3  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 283 #######################


> Neighbours evaluated; 72
> Selected Move:	5550	3	7	14	24500


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  0  0  0  0  1  3  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 284 #######################


> Neighbours evaluated; 95
> Selected Move:	5580	3	12	11	24000


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  0  0  0  1  0  3  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 
 > pw :0,225

## ITERATION 285 #######################


> Neighbours evaluated; 79
> Selected Move:	5758	3	2	18	25500


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  1  0  3  1  1  0  0  4  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22
________________________________________________________________

Best solution found: 5980
Run Termination time: 31.01.2010 11:49:22
Run duration: 00:08:24.8750000
________________________________________________________________
